Interactive, Mobile, Distributed Pattern Recognition
Identifieur interne : 001288 ( Main/Exploration ); précédent : 001287; suivant : 001289Interactive, Mobile, Distributed Pattern Recognition
Auteurs : George Nagy (informaticien) [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: As the accuracy of conventional classifiers, based only on a static partitioning of feature space, appears to be approaching a limit, it may be useful to consider alternative approaches. Interactive classification is often more accurate then algorithmic classification, and requires less time than the unaided human. It is more suitable for the recognition of natural patterns in a narrow domain like trees, weeds or faces than for symbolic patterns like letters and phonemes. On the other hand, symbolic patterns lend themselves better to using context and style to recognize entire fields instead of individual patterns. Algorithmic learning and adaptation is facilitated by accurate statistics gleaned from large samples in the case of symbolic patterns, and by skilled human judgment in the case of natural patterns. Recent technological advances like pocket computers, camera phones and wireless networks will have greater influence on mobile, distributed, interactive recognition of natural patterns than on conventional high-volume applications like mail sorting , check reading or forms processing.
Url:
DOI: 10.1007/11553595_5
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000135
- to stream Istex, to step Curation: 000133
- to stream Istex, to step Checkpoint: 000B97
- to stream Main, to step Merge: 001324
- to stream Main, to step Curation: 001288
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Interactive, Mobile, Distributed Pattern Recognition</title><author><name sortKey="Nagy, George" sort="Nagy, George" uniqKey="Nagy G" first="George" last="Nagy">George Nagy (informaticien)</name><affiliation><country>États-Unis</country><placeName><settlement type="city">Troy (New York</settlement><region type="state">État de New York</region></placeName><orgName type="lab" n="5">Institut polytechnique Rensselaer</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:ED6C553D28C60615084923FCAB4F0A5FB8FED11A</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11553595_5</idno><idno type="url">https://api.istex.fr/document/ED6C553D28C60615084923FCAB4F0A5FB8FED11A/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000135</idno><idno type="wicri:Area/Istex/Curation">000133</idno><idno type="wicri:Area/Istex/Checkpoint">000B97</idno><idno type="wicri:doubleKey">0302-9743:2005:Nagy G:interactive:mobile:distributed</idno><idno type="wicri:Area/Main/Merge">001324</idno><idno type="wicri:Area/Main/Curation">001288</idno><idno type="wicri:Area/Main/Exploration">001288</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Interactive, Mobile, Distributed Pattern Recognition</title><author><name sortKey="Nagy, George" sort="Nagy, George" uniqKey="Nagy G" first="George" last="Nagy">George Nagy (informaticien)</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>DocLab, Rensselaer Polytechnic Institute, 12180, Troy, NY</wicri:regionArea><placeName><region type="state">État de New York</region></placeName><placeName><settlement type="city">Troy (New York</settlement><region type="state">État de New York</region></placeName><orgName type="lab" n="5">Institut polytechnique Rensselaer</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country><placeName><settlement type="city">Troy (New York</settlement><region type="state">État de New York</region></placeName><orgName type="lab" n="5">Institut polytechnique Rensselaer</orgName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">ED6C553D28C60615084923FCAB4F0A5FB8FED11A</idno><idno type="DOI">10.1007/11553595_5</idno><idno type="ChapterID">5</idno><idno type="ChapterID">Chap5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: As the accuracy of conventional classifiers, based only on a static partitioning of feature space, appears to be approaching a limit, it may be useful to consider alternative approaches. Interactive classification is often more accurate then algorithmic classification, and requires less time than the unaided human. It is more suitable for the recognition of natural patterns in a narrow domain like trees, weeds or faces than for symbolic patterns like letters and phonemes. On the other hand, symbolic patterns lend themselves better to using context and style to recognize entire fields instead of individual patterns. Algorithmic learning and adaptation is facilitated by accurate statistics gleaned from large samples in the case of symbolic patterns, and by skilled human judgment in the case of natural patterns. Recent technological advances like pocket computers, camera phones and wireless networks will have greater influence on mobile, distributed, interactive recognition of natural patterns than on conventional high-volume applications like mail sorting , check reading or forms processing.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>État de New York</li></region><settlement><li>Troy (New York</li></settlement><orgName><li>Institut polytechnique Rensselaer</li></orgName></list><tree><country name="États-Unis"><region name="État de New York"><name sortKey="Nagy, George" sort="Nagy, George" uniqKey="Nagy G" first="George" last="Nagy">George Nagy (informaticien)</name></region><name sortKey="Nagy, George" sort="Nagy, George" uniqKey="Nagy G" first="George" last="Nagy">George Nagy (informaticien)</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001288 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001288 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:ED6C553D28C60615084923FCAB4F0A5FB8FED11A
|texte= Interactive, Mobile, Distributed Pattern Recognition
}}
| This area was generated with Dilib version V0.6.32. |  |